Testing Graph Isotopy on Surfaces
نویسندگان
چکیده
منابع مشابه
Testing Graph Isotopy on Surfaces
We investigate the following problem: Given two embeddings G1 and G2 of the same abstract graph G on an orientable surface S, decide whether G1 and G2 are isotopic; in other words, whether there exists a continuous family of embeddings between G1 and G2. We provide efficient algorithms to solve this problem in two models. In the first model, the input consists of the arrangement of G1 (resp., G...
متن کاملIsotopy Stability of Dynamics on Surfaces
This paper investigates dynamics that persist under isotopy in classes of orientation-preserving homeomorphisms of orientable surfaces. The persistence of periodic points with respect to periodic and strong Nielsen equivalence is studied. The existence of a dynamically minimal representative with respect to these relations is proved and necessary and sufficient conditions for the isotopy stabil...
متن کاملIsotopy problems for saddle surfaces
Four mutually dependent facts are proven. • A smooth saddle sphere in S has at least four inflection arches. • Each hyperbolic hérisson H generates an arrangement of disjoint oriented great semicircles on the unit sphere S. On the one hand, the semicircles correspond to the horns of the hérisson. On the other hand, they correspond to the inflection arches of the graph of the support function hH...
متن کاملGraph Surfaces
A broad spectrum of massive data sets can be modeled as dynamic weighted multi-digraphs with sizes ranging from tens of gigabytes to petabytes. The sheer size of these data repositories brings with it interesting visualization and computational challenges. We introduce the notion of graph surfaces as a metaphor that allows the integration of visualization and computation over these data sets. B...
متن کاملContemplations on Testing Graph Properties
This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). The first comment advocates paying more attention to the dependence of the tester’s complexity on the proximity parameter. The second comment advocates paying more attention to the question of testing general graphs (rather than...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9555-4